github.com/andybalholm/brotli.huffmanTree.total_count_ (field)

29 uses

	github.com/andybalholm/brotli (current package)
		brotli_bit_stream.go#L442: 	return v0.total_count_ < v1.total_count_
		brotli_bit_stream.go#L528: 					if (*tree)[i].total_count_ <= (*tree)[j].total_count_ {
		brotli_bit_stream.go#L536: 					if (*tree)[i].total_count_ <= (*tree)[j].total_count_ {
		brotli_bit_stream.go#L545: 					(*tree)[node-1].total_count_ = (*tree)[left].total_count_ + (*tree)[right].total_count_
		brotli_bit_stream.go#L731: 					if (*tree)[i].total_count_ <= (*tree)[j].total_count_ {
		brotli_bit_stream.go#L739: 					if (*tree)[i].total_count_ <= (*tree)[j].total_count_ {
		brotli_bit_stream.go#L748: 					(*tree)[node-1].total_count_ = (*tree)[left].total_count_ + (*tree)[right].total_count_
		entropy_encode.go#L15: 	total_count_          uint32
		entropy_encode.go#L21: 	self.total_count_ = count
		entropy_encode.go#L108: 	if v0.total_count_ != v1.total_count_ {
		entropy_encode.go#L109: 		return v0.total_count_ < v1.total_count_
		entropy_encode.go#L176: 			if tree[i].total_count_ <= tree[j].total_count_ {
		entropy_encode.go#L184: 			if tree[i].total_count_ <= tree[j].total_count_ {
		entropy_encode.go#L194: 				tree[j_end].total_count_ = tree[left].total_count_ + tree[right].total_count_